翻訳と辞書 Words near each other ・ Probelesodon ・ Proben ・ Probenecid ・ Probenecid and colchicine ・ Probergrothius ・ Probert ・ Proba-V ・ PROBA2 ・ Probabilism ・ Probabilist ・ Probabilistic analysis of algorithms ・ Probabilistic Approach for Protein NMR Assignment Validation ・ Probabilistic argument ・ Probabilistic argumentation ・ Probabilistic automaton ・ Probabilistic bisimulation ・ Probabilistic causation ・ Probabilistic classification ・ Probabilistic CTL ・ Probabilistic data association filter ・ Probabilistic database ・ Probabilistic design ・ Probabilistic encryption ・ Probabilistic forecasting ・ Probabilistic latent semantic analysis ・ Probabilistic logic ・ Probabilistic logic network ・ Probabilistic method ・ Probabilistic metric space ・ Probabilistic neural network Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Probabilistic bisimulation ： ウィキペディア英語版 Probabilistic bisimulation In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described by K.G. Larsen and A. Skou.〔K. G. Larsen and A. Skou and appeared in the article ''Bisimulation through Probabilistic Testing'', published in Information and Computation, vol 94, pages 1-28, 1991〕 A discrete probabilistic transition system is a triple : $S\; =\; (\backslash operatorname,\; \backslash operatorname,\; \backslash tau:\backslash operatorname\; \backslash times\; \backslash operatorname\backslash times\; \backslash operatorname\backslash rightarrow\; ())$ where $\backslash tau(s,a,t)$ gives the probability of starting in the state ''s'', performing the action ''a'' and ending up in the state ''t''. The set of states is assumed to be countable. There is no attempt to assign probabilities to actions. It is assumed that the actions are chosen nondeterministically by an adversary or by the environment. This type of system is fully probabilistic, there is no other indeterminacy. The definition of a probabilistic bisimulation on a system ''S'' is an equivalence relation ''R'' on the state space St, such that for every pair ''s'',''t'' in St with sRt and for every action a in Act and for every equivalence class ''C'' of ''R'' $\backslash tau(s,a,C)\; =\; \backslash tau(t,a,C).$ Two states are said to be probabilistically bisimilar if there is some such ''R'' relating them. When applied to Markov chains, probabilistic bisimulation is the same concept as lumpability.〔(Probabilistic Noninterference through Weak Probabilistic Bisimulation ) by Geoffrey Smith Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW’03) 1063-6900/03〕〔 〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Probabilistic bisimulation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.